A high-fidelity quantum state transfer algorithm on the complete bipartite graph

High-fidelity quantum state transfer is critical for communication and scalable computation. Current algorithms on the complete bipartite graph, which are based discrete-time walk search algorithms, suffer from low fidelity in some cases. To solve this problem, paper we propose a two-stage algorithm graph. The achieved by generalized Grover with one marked vertex. walk’s coin operators query oracles both parametric unitary matrices, designed flexibly positions of sender receiver size We prove that greater than $$1-2\epsilon _{1}-\epsilon _{2}-2\sqrt{2}\sqrt{\epsilon _{1}\epsilon _{2}}$$ or $$1-\left( 2+2\sqrt{2}\right) \epsilon _{2}-\left( \sqrt{\epsilon any adjustable parameters $$\epsilon _{1}$$ _{2}$$ when same partition different partitions provides novel approach to achieve high-fidelity graph case, will offer potential applications information processing.